0.04/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.13	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.13/0.35	% Computer   : n016.cluster.edu
0.13/0.35	% Model      : x86_64 x86_64
0.13/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.35	% Memory     : 8042.1875MB
0.13/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.35	% CPULimit   : 1200
0.13/0.35	% WCLimit    : 120
0.13/0.35	% DateTime   : Tue Jul 13 15:20:08 EDT 2021
0.13/0.35	% CPUTime    : 
0.13/0.35	% Number of cores: 8
0.13/0.35	% Python version: Python 3.6.8
0.13/0.35	# Version: 2.6rc1-ho
0.13/0.35	# No SInE strategy applied
0.13/0.35	# Trying AutoSched0 for 59 seconds
0.21/0.39	# AutoSched0-Mode selected heuristic G_E___208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.21/0.39	# and selection function SelectComplexExceptUniqMaxHorn.
0.21/0.39	#
0.21/0.39	# Preprocessing time       : 0.029 s
0.21/0.39	# Presaturation interreduction done
0.21/0.39	
0.21/0.39	# Proof found!
0.21/0.39	# SZS status Theorem
0.21/0.39	# SZS output start CNFRefutation
0.21/0.39	thf(cartprodmempair1, conjecture, (dsetconstrER=>![X1:$i, X5:$i, X7:$i]:(in @ X7 @ (cartprod @ X1 @ X5)=>?[X3:$i]:(in @ X3 @ X1&?[X4:$i]:((X7)=(kpair @ X3 @ X4)&in @ X4 @ X5)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cartprodmempair1)).
0.21/0.39	thf(dsetconstrER, axiom, (dsetconstrER<=>![X1:$i, X2:$i > $o, X3:$i]:(in @ X3 @ (dsetconstr @ X1 @ (^[X4:$i]:X2 @ X4))=>X2 @ X3)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', dsetconstrER)).
0.21/0.39	thf(cartprod, axiom, (cartprod)=(^[X1:$i, X5:$i]:dsetconstr @ (powerset @ (powerset @ (binunion @ X1 @ X5))) @ (^[X3:$i]:?[X4:$i]:(in @ X4 @ X1&?[X6:$i]:(in @ X6 @ X5&(X3)=(kpair @ X4 @ X6))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cartprod)).
0.21/0.39	thf(c_0_3, plain, ![X4:$i, X2:$i > $o]:(epred2_2 @ X2 @ X4<=>X2 @ X4), introduced(definition)).
0.21/0.39	thf(c_0_4, plain, ![X16:$i, X1:$i, X5:$i]:(epred1_3 @ X5 @ X1 @ X16<=>?[X17:$i]:(in @ X17 @ X1&?[X18:$i]:(in @ X18 @ X5&(X16)=(kpair @ X17 @ X18)))), introduced(definition)).
0.21/0.39	thf(c_0_5, negated_conjecture, ~((![X1:$i, X2:$i > $o, X3:$i]:(in @ X3 @ (dsetconstr @ X1 @ (epred2_2 @ X2))=>X2 @ X3)=>![X1:$i, X5:$i, X7:$i]:(in @ X7 @ (cartprod @ X1 @ X5)=>?[X3:$i]:(in @ X3 @ X1&?[X4:$i]:((X7)=(kpair @ X3 @ X4)&in @ X4 @ X5))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cartprodmempair1]), dsetconstrER]), c_0_3])).
0.21/0.39	thf(c_0_6, plain, ![X1:$i, X5:$i]:(cartprod @ X1 @ X5)=(dsetconstr @ (powerset @ (powerset @ (binunion @ X1 @ X5))) @ (epred1_3 @ X5 @ X1)), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[cartprod]), c_0_4])).
0.21/0.39	thf(c_0_7, negated_conjecture, ![X23:$i, X24:$i > $o, X25:$i, X29:$i, X30:$i]:((~in @ X25 @ (dsetconstr @ X23 @ (epred2_2 @ X24))|X24 @ X25)&(in @ esk3_0 @ (cartprod @ esk1_0 @ esk2_0)&(~in @ X29 @ esk1_0|((esk3_0)!=(kpair @ X29 @ X30)|~in @ X30 @ esk2_0)))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])).
0.21/0.39	thf(c_0_8, plain, ![X21:$i, X22:$i]:(cartprod @ X21 @ X22)=(dsetconstr @ (powerset @ (powerset @ (binunion @ X21 @ X22))) @ (epred1_3 @ X22 @ X21)), inference(variable_rename,[status(thm)],[c_0_6])).
0.21/0.39	thf(c_0_9, negated_conjecture, ![X1:$i, X3:$i, X2:$i > $o]:(X2 @ X1|~in @ X1 @ (dsetconstr @ X3 @ (epred2_2 @ X2))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.21/0.39	thf(c_0_10, plain, ![X3:$i, X1:$i]:(cartprod @ X1 @ X3)=(dsetconstr @ (powerset @ (powerset @ (binunion @ X1 @ X3))) @ (epred1_3 @ X3 @ X1)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.21/0.39	thf(c_0_11, plain, ![X1:$i, X2:$i > $o, X4:$i, X3:$i]:(X2 @ X1|(epred1_3 @ X3 @ X4)!=(epred2_2 @ X2)|~in @ X1 @ (cartprod @ X4 @ X3)), inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_9, c_0_10])])).
0.21/0.39	thf(c_0_12, negated_conjecture, in @ esk3_0 @ (cartprod @ esk1_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_7])).
0.21/0.39	thf(c_0_13, plain, ![X31:$i, X32:$i, X33:$i, X36:$i, X37:$i, X38:$i, X39:$i, X40:$i]:(((in @ (esk4_3 @ X31 @ X32 @ X33) @ X32|~epred1_3 @ X33 @ X32 @ X31)&((in @ (esk5_3 @ X31 @ X32 @ X33) @ X33|~epred1_3 @ X33 @ X32 @ X31)&((X31)=(kpair @ (esk4_3 @ X31 @ X32 @ X33) @ (esk5_3 @ X31 @ X32 @ X33))|~epred1_3 @ X33 @ X32 @ X31)))&(~in @ X39 @ X37|(~in @ X40 @ X38|(X36)!=(kpair @ X39 @ X40))|epred1_3 @ X38 @ X37 @ X36)), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])])).
0.21/0.39	thf(c_0_14, negated_conjecture, ![X2:$i > $o]:(X2 @ esk3_0|(epred2_2 @ X2)!=(epred1_3 @ esk2_0 @ esk1_0)), inference(spm,[status(thm)],[c_0_11, c_0_12])).
0.21/0.39	thf(c_0_15, negated_conjecture, ![X1:$i, X3:$i]:(~in @ X1 @ esk1_0|(esk3_0)!=(kpair @ X1 @ X3)|~in @ X3 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_7])).
0.21/0.39	thf(c_0_16, plain, ![X4:$i, X3:$i, X1:$i]:((X1)=(kpair @ (esk4_3 @ X1 @ X3 @ X4) @ (esk5_3 @ X1 @ X3 @ X4))|~epred1_3 @ X4 @ X3 @ X1), inference(split_conjunct,[status(thm)],[c_0_13])).
0.21/0.39	thf(c_0_17, plain, ![X41:$i, X42:$i > $o]:((~epred2_2 @ X42 @ X41|X42 @ X41)&(~X42 @ X41|epred2_2 @ X42 @ X41)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])).
0.21/0.39	thf(c_0_18, negated_conjecture, ![X2:$i > $o]:(X2 @ esk3_0|(epred2_2 @ X2 @ (esk7_1 @ X2))!=(epred1_3 @ esk2_0 @ esk1_0 @ (esk7_1 @ X2))), inference(neg_ext,[status(thm)],[c_0_14])).
0.21/0.39	thf(c_0_19, negated_conjecture, ![X3:$i, X1:$i]:(~in @ (esk5_3 @ esk3_0 @ X1 @ X3) @ esk2_0|~in @ (esk4_3 @ esk3_0 @ X1 @ X3) @ esk1_0|~epred1_3 @ X3 @ X1 @ esk3_0), inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16])])).
0.21/0.39	thf(c_0_20, plain, ![X4:$i, X3:$i, X1:$i]:(in @ (esk5_3 @ X1 @ X3 @ X4) @ X4|~epred1_3 @ X4 @ X3 @ X1), inference(split_conjunct,[status(thm)],[c_0_13])).
0.21/0.39	thf(c_0_21, plain, ![X2:$i > $o, X1:$i]:(X2 @ X1|~epred2_2 @ X2 @ X1), inference(split_conjunct,[status(thm)],[c_0_17])).
0.21/0.39	thf(c_0_22, negated_conjecture, ![X2:$i > $o]:(epred1_3 @ esk2_0 @ esk1_0 @ (esk7_1 @ X2)|epred2_2 @ X2 @ (esk7_1 @ X2)|X2 @ esk3_0), inference(dynamic cnf,[status(thm)],[c_0_18])).
0.21/0.39	thf(c_0_23, plain, ![X1:$i]:(~in @ (esk4_3 @ esk3_0 @ X1 @ esk2_0) @ esk1_0|~epred1_3 @ esk2_0 @ X1 @ esk3_0), inference(spm,[status(thm)],[c_0_19, c_0_20])).
0.21/0.39	thf(c_0_24, plain, ![X4:$i, X3:$i, X1:$i]:(in @ (esk4_3 @ X1 @ X3 @ X4) @ X3|~epred1_3 @ X4 @ X3 @ X1), inference(split_conjunct,[status(thm)],[c_0_13])).
0.21/0.39	thf(c_0_25, negated_conjecture, ![X2:$i > $o]:(X2 @ esk3_0|~epred1_3 @ esk2_0 @ esk1_0 @ (esk7_1 @ X2)|~epred2_2 @ X2 @ (esk7_1 @ X2)), inference(dynamic cnf,[status(thm)],[c_0_18])).
0.21/0.39	thf(c_0_26, plain, ![X2:$i > $o, X1:$i]:(epred2_2 @ X2 @ X1|~X2 @ X1), inference(split_conjunct,[status(thm)],[c_0_17])).
0.21/0.39	thf(c_0_27, plain, ![X2:$i > $o]:(epred1_3 @ esk2_0 @ esk1_0 @ (esk7_1 @ X2)|X2 @ (esk7_1 @ X2)|X2 @ esk3_0), inference(spm,[status(thm)],[c_0_21, c_0_22])).
0.21/0.39	thf(c_0_28, plain, ~epred1_3 @ esk2_0 @ esk1_0 @ esk3_0, inference(spm,[status(thm)],[c_0_23, c_0_24])).
0.21/0.39	thf(c_0_29, plain, ![X2:$i > $o]:(X2 @ esk3_0|~epred1_3 @ esk2_0 @ esk1_0 @ (esk7_1 @ X2)|~X2 @ (esk7_1 @ X2)), inference(spm,[status(thm)],[c_0_25, c_0_26])).
0.21/0.39	thf(c_0_30, plain, epred1_3 @ esk2_0 @ esk1_0 @ (esk7_1 @ (epred1_3 @ esk2_0 @ esk1_0)), inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_27]), c_0_28])).
0.21/0.39	thf(c_0_31, plain, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_30]), c_0_30])]), c_0_28]), ['proof']).
0.21/0.39	# SZS output end CNFRefutation
0.21/0.39	# Proof object total steps             : 32
0.21/0.39	# Proof object clause steps            : 21
0.21/0.39	# Proof object formula steps           : 11
0.21/0.39	# Proof object conjectures             : 11
0.21/0.39	# Proof object clause conjectures      : 8
0.21/0.39	# Proof object formula conjectures     : 3
0.21/0.39	# Proof object initial clauses used    : 9
0.21/0.39	# Proof object initial formulas used   : 3
0.21/0.39	# Proof object generating inferences   : 8
0.21/0.39	# Proof object simplifying inferences  : 6
0.21/0.39	# Training examples: 0 positive, 0 negative
0.21/0.39	# Parsed axioms                        : 13
0.21/0.39	# Removed by relevancy pruning/SinE    : 0
0.21/0.39	# Initial clauses                      : 20
0.21/0.39	# Removed in clause preprocessing      : 9
0.21/0.39	# Initial clauses in saturation        : 11
0.21/0.39	# Processed clauses                    : 36
0.21/0.39	# ...of these trivial                  : 0
0.21/0.39	# ...subsumed                          : 0
0.21/0.39	# ...remaining for further processing  : 36
0.21/0.39	# Other redundant clauses eliminated   : 3
0.21/0.39	# Clauses deleted for lack of memory   : 0
0.21/0.39	# Backward-subsumed                    : 0
0.21/0.39	# Backward-rewritten                   : 0
0.21/0.39	# Generated clauses                    : 29
0.21/0.39	# ...of the previous two non-trivial   : 23
0.21/0.39	# Contextual simplify-reflections      : 0
0.21/0.39	# Paramodulations                      : 17
0.21/0.39	# Factorizations                       : 2
0.21/0.39	# NegExts                              : 2
0.21/0.39	# Equation resolutions                 : 3
0.21/0.39	# Propositional unsat checks           : 0
0.21/0.39	#    Propositional check models        : 0
0.21/0.39	#    Propositional check unsatisfiable : 0
0.21/0.39	#    Propositional clauses             : 0
0.21/0.39	#    Propositional clauses after purity: 0
0.21/0.39	#    Propositional unsat core size     : 0
0.21/0.39	#    Propositional preprocessing time  : 0.000
0.21/0.39	#    Propositional encoding time       : 0.000
0.21/0.39	#    Propositional solver time         : 0.000
0.21/0.39	#    Success case prop preproc time    : 0.000
0.21/0.39	#    Success case prop encoding time   : 0.000
0.21/0.39	#    Success case prop solver time     : 0.000
0.21/0.39	# Current number of processed clauses  : 22
0.21/0.39	#    Positive orientable unit clauses  : 4
0.21/0.39	#    Positive unorientable unit clauses: 0
0.21/0.39	#    Negative unit clauses             : 1
0.21/0.39	#    Non-unit-clauses                  : 17
0.21/0.39	# Current number of unprocessed clauses: 9
0.21/0.39	# ...number of literals in the above   : 23
0.21/0.39	# Current number of archived formulas  : 0
0.21/0.39	# Current number of archived clauses   : 13
0.21/0.39	# Clause-clause subsumption calls (NU) : 80
0.21/0.39	# Rec. Clause-clause subsumption calls : 67
0.21/0.39	# Non-unit clause-clause subsumptions  : 0
0.21/0.39	# Unit Clause-clause subsumption calls : 2
0.21/0.39	# Rewrite failures with RHS unbound    : 0
0.21/0.39	# BW rewrite match attempts            : 0
0.21/0.39	# BW rewrite match successes           : 0
0.21/0.39	# Condensation attempts                : 0
0.21/0.39	# Condensation successes               : 0
0.21/0.39	# Termbank termtop insertions          : 1694
0.21/0.39	
0.21/0.39	# -------------------------------------------------
0.21/0.39	# User time                : 0.028 s
0.21/0.39	# System time              : 0.007 s
0.21/0.39	# Total time               : 0.035 s
0.21/0.39	# Maximum resident set size: 1644 pages
0.21/0.39	EOF